A Probabilistic Approach to Automatic Verification of Concurrent Systems1
نویسندگان
چکیده
The main obstruction to automatic verification of concurrent systems is the hu e amount of memory required to complete the veriLation task (state explothis paper we present a probabilistic algorithm for automatic verification via model checking. Our algorithm trades space with time. In particular, when our memory is over because of state explosion our algorithm does not give up verijication. Instead it jus t proceeds at a lower speed and its results will only hold with some arbitrarily small error probability. Our preliminary experimental results show that using our probabilistic algorithm we can typically save more than 30% of R A M with an average time penalty of about 100% w.r.t. a deterministic state space exploration with enough memory t o complete the verification task. This is better than having t o give up the werification task because of lack of memory.
منابع مشابه
A Trust Based Probabilistic Method for Efficient Correctness Verification in Database Outsourcing
Correctness verification of query results is a significant challenge in database outsourcing. Most of the proposed approaches impose high overhead, which makes them impractical in real scenarios. Probabilistic approaches are proposed in order to reduce the computation overhead pertaining to the verification process. In this paper, we use the notion of trust as the basis of our probabilistic app...
متن کاملتحلیل الگوهای همزمان در نمودارهای کنترل فرآیند آماری با استفاده از شبکه عصبی
Statistical Process Control (SPC) charts play a major role in quality control systems, and their correct interpretation leads to discovering probable irregularities and errors of the production system. In this regard, various artificial neural networks have been developed to identify mainly singular patterns of SPC charts, while having drawbacks in handling multiple concurrent patterns. In th...
متن کاملFair Termination for Parameterized Probabilistic Concurrent Systems (Technical Report)
We consider the problem of automatically verifying that a parameterized family of probabilistic concurrent systems terminates with probability one for all instances against adversarial schedulers. A parameterized family defines an infinite-state system: for each number n, the family consists of an instance with n finite-state processes. In contrast to safety, the parameterized verification of l...
متن کاملFair Termination for Parameterized Probabilistic Concurrent Systems
We consider the problem of automatically verifying that a parameterized family of probabilistic concurrent systems terminates with probability one for all instances against adversarial schedulers. A parameterized family defines an infinite-state system: for each number n, the family consists of an instance with n finite-state processes. In contrast to safety, the parameterized verification of l...
متن کامل